Challenges and Progress on Using Large Lossy Endgame Databases in Chinese Checkers
نویسنده
چکیده
منابع مشابه
UCT Enhancements in Chinese Checkers Using an Endgame Database
The UCT algorithm has gained popularity for use in AI for games, especially in board games. This paper assess the performance of UCT-based AIs and the effectiveness of augmenting them with a lookup table containing evaluations of games states in the game of Chinese Checkers. Our lookup table is only guaranteed to be correct during the endgame, but serves as an accurate heuristic throughout the ...
متن کاملPartial Information Endgame Databases
Endgame databases have previously been built based on complete analysis of endgame positions. In the domain of Checkers, where endgame databases consisting of 39 trillion positions have already been built, it would be beneficial to be able to build select portions of even larger databases, without fully computing portions of the database that will almost never be needed. We present a new win-lo...
متن کاملThe 7-piece Perfect Play Lookup Database for the Game of Checkers
Many research teams and individuals have computed endgame databases for the game of chess which use the distance-to-mate metric, enabling their software to forecast the number of moves remaining until the game is over. This is not the case for the game of checkers. Only one programming team has generated a checkers database capable of announcing the distance to the terminal position. This paper...
متن کاملA Re-Examination of Brute-Force Search
In August 1992, the World Checkers Champion, Dr. Marion Tinsley, defended his title against the computer program Chinook. The best-of-40-game match was won by Tinsley with 4 wins to the program's 2. This was the first time in history that a program played for a human World Championship. Chinook, with its deep search and endgame databases, has established itself as a Grandmaster checker player. ...
متن کاملBest Play in Fanorona Leads to Draw
Fanorona is the national board game of Madagascar. The game’s complexity is approximately the same as that of checkers. In this article we present a search-based approach for weakly solving this game. It is a well-chosen combination of Proof-Number search and endgame databases. Retrograde analysis is used to generate the endgame databases in which every position with 7 or fewer pieces on the bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015